Grouping Line-segments using Eigenclustering
نویسندگان
چکیده
This paper presents an eigenclustering approach to line-segment grouping. We make three contributions. First, we show how the geometry of the lineendpoints can be used to compute a grouping field by interpolating a polar lemniscate between them. Second, we show how to adaptively threshold the grouping field to produce a line-adjacency matrix. Finally, we present a non-iterative method for locating line-groupings using the eigenvectors of the adjacency matrix.
منابع مشابه
An expectation-maximisation framework for segmentation and grouping
This paper casts the problem of perceptual grouping into an evidence combining setting using the apparatus of the EM algorithm. We are concerned with recovering a perceptual arrangement graph for line-segments using evidence provided by a raw perceptual grouping field. The perceptual grouping process is posed as one of pairwise relational clustering. The task is to assign line-segments (or othe...
متن کاملA Maximum Likelihood Framework for Iterative Eigendecomposition
This paper presents an iterative maximum likelihood framework for perceptual grouping. We pose the problem of perceptual grouping as one of pairwise relational clustering. The method is quite generic and can be applied to a number of problems including region segmentation and line-linking. The task is to assign image tokens to clusters in which there is strong relational affinity between token ...
متن کاملFast line segment grouping method for finding globally more favorable line segments
In this paper, we propose a new method for extracting line segments from edge images. Our method basically follows a line segment grouping approach. This approach has many advantages over a Hough transform based approach in practical situations. However, since the process of the conventional line segment grouping approach is purely local, it does not provide a mechanism for "nding more favorabl...
متن کاملOptimal Grouping of Line Segments into Convex Sets
In this paper, we present a technique for grouping line segments into convex sets, where the line segments are obtained by linking edges obtained from the Canny edge detector. The novelty of the approach is twofold: first we define an efficient approach for testing the global convexity criterion, and second, we develop an optimal search based on dynamic programming for grouping the line segment...
متن کاملLINE-SEGMENTS CRITICAL SLIP SURFACE IN EARTH SLOPES USING AN OPTIMIZATION METHOD
In this paper the factor of safety (FS) and critical line-segments slip surface obtained by the Alternating Variable Local Gradient (AVLG) optimization method was presented as a new topic in 2D. Results revealed that the percentage of reduction in the FS obtained by switching from a circular shape to line segments was higher with the AVLG method than other methods. The 2D-AVLG optimization meth...
متن کامل